Circular Degree Choosability
نویسندگان
چکیده
منابع مشابه
Circular Degree Choosability
We extend a characterization of degree-choosable graphs due to Borodin [1], and Erdős, Rubin and Taylor [2], to circular list-colorings.
متن کاملCircular choosability
We study circular choosability, a notion recently introduced by Mohar and by Zhu. First, we provide a negative answer to a question of Zhu about circular cliques. We next prove that cch(G) = O (ch(G) + ln |V (G)|) for every graph G. We investigate a generalisation of circular choosability, the circular f -choosability, where f is a function of the degrees. We also consider the circular choice n...
متن کاملCircular choosability of graphs
This paper discusses the circular version of list coloring of graphs. We give two definitions of the circular list chromatic number (or circular choosability) of a graph and prove that they are equivalent. Then we prove that for any graph , . Examples are given to show that this bound is sharp in the sense that for any , there is a graph with . It is also proved that -degenerate graphs have . T...
متن کاملCircular choosability is rational
The circular choosability or circular list chromatic number of a graph is a list-version of the circular chromatic number, introduced by Mohar [4] and studied in [17, 2, 5, 7, 8, 15] and [10]. One of the nice properties that the circular chromatic number enjoys is that it is a rational number for all finite graphs G (see for instance [16]), and a fundamental question, posed by Zhu [17] and reit...
متن کاملBeyond Degree Choosability
Let G be a connected graph with maximum degree ∆. Brooks’ theorem states that G has a ∆-coloring unless G is a complete graph or an odd cycle. A graph G is degree-choosable if G can be properly colored from its lists whenever each vertex v gets a list of d(v) colors. In the context of list coloring, Brooks’ theorem can be strengthened to the following. Every connected graph G is degree-choosabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2008
ISSN: 1077-8926
DOI: 10.37236/824